Broadcasting A Message In A Parallel Computer

ABSTRACT

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

This invention was made with Government support under Contract No.B554331 awarded by the Department of Energy. The Government has certainrights in this invention.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The field of the invention is data processing, or, more specifically,methods, systems, and products for broadcasting a message in a parallelcomputer.

2. Description Of Related Art

The development of the EDVAC computer system of 1948 is often cited asthe beginning of the computer era. Since that time, computer systemshave evolved into extremely complicated devices. Today's computers aremuch more sophisticated than early systems such as the EDVAC. Computersystems typically include a combination of hardware and softwarecomponents, application programs, operating systems, processors, buses,memory, input/output devices, and so on. As advances in semiconductorprocessing and computer architecture push the performance of thecomputer higher and higher, more sophisticated computer software hasevolved to take advantage of the higher performance of the hardware,resulting in computer systems today that are much more powerful thanjust a few years ago.

Parallel computing is an area of computer technology that hasexperienced advances. Parallel computing is the simultaneous executionof the same task (split up and specially adapted) on multiple processorsin order to obtain results faster. Parallel computing is based on thefact that the process of solving a problem usually can be divided intosmaller tasks, which may be carried out simultaneously with somecoordination.

Parallel computers execute parallel algorithms. A parallel algorithm canbe split up to be executed a piece at a time on many differentprocessing devices, and then put back together again at the end to get adata processing result. Some algorithms are easy to divide up intopieces. Splitting up the job of checking all of the numbers from one toa hundred thousand to see which are primes could be done, for example,by assigning a subset of the numbers to each available processor, andthen putting the list of positive results back together. In thisspecification, the multiple processing devices that execute theindividual pieces of a parallel program are referred to as ‘computenodes.’ A parallel computer is composed of compute nodes and otherprocessing nodes as well, including, for example, input/output (‘I/O’)nodes, and service nodes.

Parallel algorithms are valuable because it is faster to perform somekinds of large computing tasks via a parallel algorithm than it is via aserial (non-parallel) algorithm, because of the way modern processorswork. It is far more difficult to construct a computer with a singlefast processor than one with many slow processors with the samethroughput. There are also certain theoretical limits to the potentialspeed of serial processors. On the other hand, every parallel algorithmhas a serial part and so parallel algorithms have a saturation point.After that point adding more processors does not yield any morethroughput but only increases the overhead and cost.

Parallel algorithms are designed also to optimize one more resource thedata communications requirements among the nodes of a parallel computer.There are two ways parallel processors communicate, shared memory ormessage passing. Shared memory processing needs additional locking forthe data and imposes the overhead of additional processor and bus cyclesand also serializes some portion of the algorithm.

Message passing processing uses high-speed data communications networksand message buffers, but this communication adds transfer overhead onthe data communications networks as well as additional memory needed formessage buffers and latency in the data communications among nodes.Designs of parallel computers use specially designed data communicationslinks so that the communication overhead will be small but it is theparallel algorithm that decides the volume of the traffic.

Many data communications network topologies are used for message passingamong nodes in parallel computers. Such network topologies may includefor example, a tree, a rectangular mesh, and a torus. In a tree network,the nodes typically are connected into a binary tree: each nodetypically has a parent and two children (although some nodes may onlyhave zero children or one child, depending on the hardwareconfiguration). A tree network typically supports communications wheredata from one compute node migrates through tiers of the tree network toa root compute node or where data is multicast from the root to all ofthe other compute nodes in the tree network. In such a manner, the treenetwork lends itself to collective operations such as, for example,reduction operations or broadcast operations. The tree network, however,does not lend itself to and is typically inefficient for point-to-pointoperations.

A rectangular mesh topology connects compute nodes in athree-dimensional mesh, and every node is connected with up to sixneighbors through this mesh network. Each compute node in the mesh isaddressed by its x, y, and z coordinate. A torus network connects thenodes in a manner similar to the three-dimensional mesh topology, butadds wrap-around links in each dimension such that every node isconnected to its six neighbors through this torus network. In computersthat use a torus and a tree network, the two networks typically areimplemented independently of one another, with separate routingcircuits, separate physical links, and separate message buffers. Othernetwork topology often used to connect nodes of a network includes astar, a ring, or a hypercube. While the tree network generally lendsitself to collective operations, a mesh or a torus network generallylends itself well for point-to-point communications. Although in generaleach type of network is optimized for certain communications patterns,those communications patterns may generally be supported by any type ofnetwork.

As mentioned above, the tree network is optimized for collectiveoperations. Some collective operations have a single originating orreceiving process running on a particular compute node in an operationalgroup. For example, in a ‘broadcast’ collective operation, the processon the compute node that distributes the data to all the other computenodes is an originating process. In a ‘gather’ operation, for example,the process on the compute node that received all the data from theother compute nodes is a receiving process. The compute node on whichsuch an originating or receiving process runs is referred to as alogical root.

The collective tree network supports efficient collective operationsbecause of the low latency associated with propagating a logical root'smessage to all of the other nodes in the collective tree network. Thelow latency for such data transfers result from the collective treenetwork's ability to multicast data from the physical root of the treeto the leaf nodes of the tree. The physical root of the collective treenetwork is the node at the top of the physical tree topology and isphysically configured to only have child nodes without a parent node. Incontrast, the leaf nodes are nodes at the bottom of the tree topologyand are physically wired to only have a parent node without any childrennodes. Currently, when the logical root is ready to broadcast a messageto the other nodes in the operational group, the logical root must firstsend the entire message to the physical root of the tree network, whichin turn, multicasts the entire message down the tree network to all thenodes in the operational group. The drawback to this current mechanismis that the initial step of sending the entire message from the logicalroot to the physical root before any of the other nodes receive themessage may delay the propagation of the message to all of the nodes inthe operational group.

SUMMARY OF THE INVENTION

Methods, systems, and products are disclosed for broadcasting a messagein a parallel computer. The parallel computer includes a plurality ofnodes connected together using a multicast data communications networkoptimized for collective operations. One node is configured as aphysical root. The nodes are organized into at least one operationalgroup of nodes for collective parallel operations, and one node isassigned to be a logical root. Broadcasting a message in a parallelcomputer includes: transmitting, by the logical root to all of the nodesin the operational group directly connected to the logical root, amessage; and for each node in the operational group except the logicalroot: receiving, by that node, the message; if that node is the physicalroot, then transmitting, by that node, the message to all of the childnodes of the physical root except the child node from which the messagewas received; if that node received the message from the parent node forthat node and if that node is not a leaf node, then transmitting, bythat node, the message to all of the child nodes of that node; and ifthat node received the message from a child node and if that node is notthe physical root, then transmitting, by that node, the message to allof the child nodes of that node except the child node from which themessage was received and transmitting the message to the parent node ofthat node.

The foregoing and other objects, features and advantages of theinvention will be apparent from the following more particulardescriptions of exemplary embodiments of the invention as illustrated inthe accompanying drawings wherein like reference numbers generallyrepresent like parts of exemplary embodiments of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an exemplary parallel computer for broadcasting amessage in a parallel computer according to embodiments of the presentinvention.

FIG. 2 sets forth a block diagram of an exemplary compute node useful ina parallel computer capable of broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 3A illustrates an exemplary Point To Point Adapter useful in aparallel computer capable of broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 3B illustrates an exemplary Global Combining Network Adapter usefulin a parallel computer capable of broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 4 sets forth a line drawing illustrating an exemplary datacommunications network optimized for point to point operations useful ina parallel computer capable of broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 5 sets forth a line drawing illustrating an exemplary datacommunications network optimized for collective operations useful in aparallel computer capable of broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 6 sets forth a line drawing illustrating exemplary compute nodes inan operational group useful in broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 7 sets forth a line drawing illustrating exemplary compute nodes inan operational group useful in broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 8 sets forth a line drawing illustrating exemplary compute nodes inan operational group useful in broadcasting a message in a parallelcomputer according to embodiments of the present invention.

FIG. 9 sets forth a flow chart illustrating an exemplary method forbroadcasting a message in a parallel computer according to embodimentsof the present invention.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Exemplary methods, systems, and computer program products forbroadcasting a message in a parallel computer according to embodimentsof the present invention are described with reference to theaccompanying drawings, beginning with FIG. 1. FIG. 1 illustrates anexemplary parallel computer for broadcasting a message in a parallelcomputer according to embodiments of the present invention. The systemof FIG. 1 includes a parallel computer (100), non-volatile memory forthe computer in the form of data storage device (118), an output devicefor the computer in the form of printer (120), and an input/outputdevice for the computer in the form of computer terminal (122). Parallelcomputer (100) in the example of FIG. 1 includes a plurality of computenodes (102).

The compute nodes (102) are coupled for data communications by severalindependent data communications networks including a Joint Test ActionGroup (‘JTAG’) network (104), a global combining network (106) which isoptimized for collective operations, and a rectangular mesh or torusnetwork (108) which is optimized point to point operations. Therectangular mesh or torus network (108) is characterized by at least twodimensions. The global combining network (106) is a multicast datacommunications network that includes data communications links connectedto the compute nodes so as to organize the compute nodes as a tree. Eachdata communications network is implemented with data communicationslinks among the compute nodes (102). The data communications linksprovide data communications for parallel operations among the computenodes of the parallel computer. The links between compute nodes arebidirectional links that are typically implemented using two separatedirectional data communications paths.

In addition, the compute nodes (102) of parallel computer are organizedinto at least one operational group (132) of compute nodes forcollective parallel operations on parallel computer (100). Anoperational group of compute nodes is the set of compute nodes uponwhich a collective parallel operation executes. Collective operationsare implemented with data communications among the compute nodes of anoperational group. Collective operations are those functions thatinvolve all the compute nodes of an operational group. A collectiveoperation is an operation, a message-passing computer programinstruction that is executed simultaneously, that is, at approximatelythe same time, by all the compute nodes in an operational group ofcompute nodes. Such an operational group may include all the computenodes in a parallel computer (100) or a subset all the compute nodes.Collective operations are often built around point to point operations.A collective operation requires that all processes on all compute nodeswithin an operational group call the same collective operation withmatching arguments. A ‘broadcast’ is an example of a collectiveoperation for moving data among compute nodes of an operational group. A‘reduce’ operation is an example of a collective operation that executesarithmetic or logical functions on data distributed among the computenodes of an operational group. An operational group may be implementedas, for example, an MPI ‘communicator.’

‘MPI’ refers to ‘Message Passing Interface,’ a prior art parallelcommunications library, a module of computer program instructions fordata communications on parallel computers. Examples of prior-artparallel communications libraries that may be improved for use withsystems according to embodiments of the present invention include MPIand the ‘Parallel Virtual Machine’ (‘PVM’) library. PVM was developed bythe University of Tennessee, The Oak Ridge National Laboratory, andEmory University. MPI is promulgated by the MPI Forum, an open groupwith representatives from many organizations that define and maintainthe MPI standard. MPI at the time of this writing is a de facto standardfor communication among compute nodes running a parallel program on adistributed memory parallel computer. This specification sometimes usesMPI terminology for ease of explanation, although the use of MPI as suchis not a requirement or limitation of the present invention.

Some collective operations have a single originating or receivingprocess running on a particular compute node in an operational group.For example, in a ‘broadcast’ collective operation, the process on thecompute node that distributes the data to all the other compute nodes isan originating process. In a ‘gather’ operation, for example, theprocess on the compute node that received all the data from the othercompute nodes is a receiving process. The compute node on which such anoriginating or receiving process runs is referred to as a logical root.

Most collective operations are variations or combinations of four basicoperations: broadcast, gather, scatter, and reduce. The interfaces forthese collective operations are defined in the MPI standards promulgatedby the MPI Forum. Algorithms for executing collective operations,however, are not defined in the MPI standards. In a broadcast operation,all processes specify the same root process, whose buffer contents willbe sent. Processes other than the root specify receive buffers. Afterthe operation, all buffers contain the message from the root process.

In a scatter operation, the logical root divides data on the root intosegments and distributes a different segment to each compute node in theoperational group. In scatter operation, all processes typically specifythe same receive count. The send arguments are only significant to theroot process, whose buffer actually contains sendcount * N elements of agiven data type, where N is the number of processes in the given groupof compute nodes. The send buffer is divided and dispersed to allprocesses (including the process on the logical root). Each compute nodeis assigned a sequential identifier termed a ‘rank.’ After theoperation, the root has sent sendcount data elements to each process inincreasing rank order. Rank 0 receives the first sendcount data elementsfrom the send buffer. Rank 1 receives the second sendcount data elementsfrom the send buffer, and so on.

A gather operation is a many-to-one collective operation that is acomplete reverse of the description of the scatter operation. That is, agather is a many-to-one collective operation in which elements of adatatype are gathered from the ranked compute nodes into a receivebuffer in a root node.

A reduce operation is also a many-to-one collective operation thatincludes an arithmetic or logical function performed on two dataelements. All processes specify the same ‘count’ and the same arithmeticor logical function. After the reduction, all processes have sent countdata elements from computer node send buffers to the root process. In areduction operation, data elements from corresponding send bufferlocations are combined pair-wise by arithmetic or logical operations toyield a single corresponding element in the root process's receivebuffer. Application specific reduction operations can be defined atruntime. Parallel communications libraries may support predefinedoperations. MPI, for example, provides the following pre-definedreduction operations:

MPI_MAX maximum MPI_MIN minimum MPI_SUM sum MPI_PROD product MPI_LANDlogical and MPI_BAND bitwise and MPI_LOR logical or MPI_BOR bitwise orMPI_LXOR logical exclusive or MPI_BXOR bitwise exclusive or

In addition to compute nodes, the parallel computer (100) includesinput/output (‘I/O’) nodes (110, 114) coupled to compute nodes (102)through the global combining network (106). The compute nodes in theparallel computer (100) are partitioned into processing sets such thateach compute node in a processing set is connected for datacommunications to the same I/O node. Each processing set, therefore, iscomposed of one I/O node and a subset of compute nodes (102). The ratiobetween the number of compute nodes to the number of I/O nodes in theentire system typically depends on the hardware configuration for theparallel computer. For example, in some configurations, each processingset may be composed of eight compute nodes and one I/O node. In someother configurations, each processing set may be composed of sixty-fourcompute nodes and one I/O node. Such example are for explanation only,however, and not for limitation. Each I/O nodes provide I/O servicesbetween compute nodes (102) of its processing set and a set of I/Odevices. In the example of FIG. 1, the I/O nodes (110, 114) areconnected for data communications I/O devices (118, 120, 122) throughlocal area network (‘LAN’) (130) implemented using high-speed Ethernet.

The parallel computer (100) of FIG. 1 also includes a service node (116)coupled to the compute nodes through one of the networks (104). Servicenode (116) provides services common to pluralities of compute nodes,administering the configuration of compute nodes, loading programs intothe compute nodes, starting program execution on the compute nodes,retrieving results of program operations on the computer nodes, and soon. Service node (116) runs a service application (124) and communicateswith users (128) through a service application interface (126) that runson computer terminal (122).

As described in more detail below in this specification, the parallelcomputer (100) of FIG. 1 operates generally for broadcasting a messagein a parallel computer according to embodiments of the presentinvention. The parallel computer (100) of FIG. 1 operates generally forbroadcasting a message in a parallel computer according to embodimentsof the present invention by: transmitting, by a logical root to all ofthe compute nodes in the operational group directly connected to thelogical root, a message for broadcasting to all of the compute nodes inthe operational group; and for each compute node in the operationalgroup except the logical root: receiving, by that compute node, themessage for broadcasting to all of the compute nodes in the operationalgroup; if that compute node is the physical root, then transmitting, bythat compute node, the message to all of the child nodes of the physicalroot except the child node from which the message was received; if thatcompute node received the message from the parent node for that computenode and if that compute node is not a leaf node, then transmitting, bythat compute node, the message to all of the child nodes of that computenode; and if that compute node received the message from a child nodeand if that compute node is not the physical root, then transmitting, bythat compute node, the message to all of the child nodes of that computenode except the child node from which the message was received andtransmitting the message to the parent node of that compute node. Themessage broadcast by the logical root may be implemented as the logicalroot's contribution to a collective operation such as, for example, anall-to-all operation, an allgather operation, and so on.

The arrangement of nodes, networks, and I/O devices making up theexemplary system illustrated in FIG. 1 are for explanation only, not forlimitation of the present invention. Data processing systems capable ofbroadcasting a message in a parallel computer according to embodimentsof the present invention may include additional nodes, networks,devices, and architectures, not shown in FIG. 1, as will occur to thoseof skill in the art. Although the parallel computer (100) in the exampleof FIG. 1 includes sixteen compute nodes (102), readers will note thatparallel computers capable of determining when a set of compute nodesparticipating in a barrier operation are ready to exit the barrieroperation according to embodiments of the present invention may includeany number of compute nodes. In addition to Ethernet and JTAG, networksin such data processing systems may support many data communicationsprotocols including for example TCP (Transmission Control Protocol), IP(Internet Protocol), and others as will occur to those of skill in theart. Various embodiments of the present invention may be implemented ona variety of hardware platforms in addition to those illustrated in FIG.1.

Broadcasting a message in a parallel computer according to embodimentsof the present invention may be generally implemented on a parallelcomputer that includes a plurality of compute nodes. In fact, suchcomputers may include thousands of such compute nodes. Each compute nodeis in turn itself a kind of computer composed of one or more computerprocessors (or processing cores), its own computer memory, and its owninput/output adapters. For further explanation, therefore, FIG. 2 setsforth a block diagram of an exemplary compute node useful in a parallelcomputer capable of broadcasting a message in a parallel computeraccording to embodiments of the present invention. The compute node(152) of FIG. 2 includes one or more processing cores (164) as well asrandom access memory (‘RAM’) (156). The processing cores (164) areconnected to RAM (156) through a high-speed memory bus (154) and througha bus adapter (194) and an extension bus (168) to other components ofthe compute node (152).

Stored in RAM (156) is an application (158), a module of computerprogram instructions that carries out parallel, user-level dataprocessing using parallel algorithms. Also stored in RAM (156) is amessaging module (160), a library of computer program instructions thatcarry out parallel communications among compute nodes, including pointto point operations as well as collective operations. Application (158)executes point to point and collective operations by calling softwareroutines in the messaging module (160). A library of parallelcommunications routines may be developed from scratch for use in systemsaccording to embodiments of the present invention, using a traditionalprogramming language such as the C programming language, and usingtraditional programming methods to write parallel communicationsroutines that send and receive data among nodes on two independent datacommunications networks. Alternatively, existing prior art libraries maybe improved to operate according to embodiments of the presentinvention. Examples of prior-art parallel communications librariesinclude the ‘Message Passing Interface’ (‘MPI’) library and the‘Parallel Virtual Machine’ (‘PVM’) library.

The application (158) or the messaging module (160) may include computerprogram instructions for broadcasting a message in a parallel computeraccording to embodiments of the present invention. The application (158)or the messaging module (160) may operate generally for broadcasting amessage in a parallel computer according to embodiments of the presentinvention by: transmitting, by a logical root to all of the computenodes in the operational group directly connected to the logical root, amessage for broadcasting to all of the compute nodes in the operationalgroup; and for each compute node in the operational group except thelogical root: receiving, by that compute node, the message forbroadcasting to all of the compute nodes in the operational group; ifthat compute node is the physical root, then transmitting, by thatcompute node, the message to all of the child nodes of the physical rootexcept the child node from which the message was received; if thatcompute node received the message from the parent node for that computenode and if that compute node is not a leaf node, then transmitting, bythat compute node, the message to all of the child nodes of that computenode; and if that compute node received the message from a child nodeand if that compute node is not the physical root, then transmitting, bythat compute node, the message to all of the child nodes of that computenode except the child node from which the message was received andtransmitting the message to the parent node of that compute node.

Also stored in RAM (156) is an operating system (162), a module ofcomputer program instructions and routines for an application program'saccess to other resources of the compute node. It is typical for anapplication program and parallel communications library in a computenode of a parallel computer to run a single thread of execution with nouser login and no security issues because the thread is entitled tocomplete access to all resources of the node. The quantity andcomplexity of tasks to be performed by an operating system on a computenode in a parallel computer therefore are smaller and less complex thanthose of an operating system on a serial computer with many threadsrunning simultaneously. In addition, there is no video I/O on thecompute node (152) of FIG. 2, another factor that decreases the demandson the operating system. The operating system may therefore be quitelightweight by comparison with operating systems of general purposecomputers, a pared down version as it were, or an operating systemdeveloped specifically for operations on a particular parallel computer.Operating systems that may usefully be improved, simplified, for use ina compute node include UNIX™, Linux™, Microsoft XP™, AIX™, IBM's i5/OS™,and others as will occur to those of skill in the art.

The exemplary compute node (152) of FIG. 2 includes severalcommunications adapters (172, 176, 180, 188) for implementing datacommunications with other nodes of a parallel computer. Such datacommunications may be carried out serially through RS-232 connections,through external buses such as Universal Serial Bus (‘USB’), throughdata communications networks such as IP networks, and in other ways aswill occur to those of skill in the art. Communications adaptersimplement the hardware level of data communications through which onecomputer sends data communications to another computer, directly orthrough a network. Examples of communications adapters useful in systemsfor broadcasting a message in a parallel computer according toembodiments of the present invention include modems for wiredcommunications, Ethernet (IEEE 802.3) adapters for wired networkcommunications, and 802.11b adapters for wireless networkcommunications.

The data communications adapters in the example of FIG. 2 include aGigabit Ethernet adapter (172) that couples example compute node (152)for data communications to a Gigabit Ethernet (174). Gigabit Ethernet isa network transmission standard, defined in the IEEE 802.3 standard,that provides a data rate of 1 billion bits per second (one gigabit).Gigabit Ethernet is a variant of Ethernet that operates over multimodefiber optic cable, single mode fiber optic cable, or unshielded twistedpair.

The data communications adapters in the example of FIG. 2 includes aJTAG Slave circuit (176) that couples example compute node (152) fordata communications to a JTAG Master circuit (178). JTAG is the usualname used for the IEEE 1149.1 standard entitled Standard Test AccessPort and Boundary-Scan Architecture for test access ports used fortesting printed circuit boards using boundary scan. JTAG is so widelyadapted that, at this time, boundary scan is more or less synonymouswith JTAG. JTAG is used not only for printed circuit boards, but alsofor conducting boundary scans of integrated circuits, and is also usefulas a mechanism for debugging embedded systems, providing a convenient“back door” into the system. The example compute node of FIG. 2 may beall three of these: It typically includes one or more integratedcircuits installed on a printed circuit board and may be implemented asan embedded system having its own processor, its own memory, and its ownI/O capability. JTAG boundary scans through JTAG Slave (176) mayefficiently configure processor registers and memory in compute node(152) for use in broadcasting a message in a parallel computer accordingto embodiments of the present invention.

The data communications adapters in the example of FIG. 2 includes aPoint To Point Adapter (180) that couples example compute node (152) fordata communications to a network (108) that is optimal for point topoint message passing operations such as, for example, a networkconfigured as a three-dimensional torus or mesh. Point To Point Adapter(180) provides data communications in six directions on threecommunications axes, x, y, and z, through six bidirectional links: +x(181), −x (182), +y (183), −y (184), +z (185), and −z (186).

The data communications adapters in the example of FIG. 2 includes aGlobal Combining Network Adapter (188) that couples example compute node(152) for data communications to a network (106) that is optimal forcollective message passing operations on a global combining networkconfigured, for example, as a binary tree. The Global Combining NetworkAdapter (188) provides data communications through three bidirectionallinks: two to children nodes (190) and one to a parent node (192).

Example compute node (152) includes two arithmetic logic units (‘ALUs’).ALU (166) is a component of each processing core (164), and a separateALU (170) is dedicated to the exclusive use of Global Combining NetworkAdapter (188) for use in performing the arithmetic and logical functionsof reduction operations. Computer program instructions of a reductionroutine in parallel communications library (160) may latch aninstruction for an arithmetic or logical function into instructionregister (169). When the arithmetic or logical function of a reductionoperation is a ‘sum’ or a ‘logical or,’ for example, Global CombiningNetwork Adapter (188) may execute the arithmetic or logical operation byuse of ALU (166) in processor (164) or, typically much faster, by usededicated ALU (170).

The example compute node (152) of FIG. 2 includes a direct memory access(‘DMA’) controller (195), which is computer hardware for direct memoryaccess and a DMA engine (197), which is computer software for directmemory access. In the example of FIG. 2, the DMA engine (197) isconfigured in computer memory of the DMA controller (195). Direct memoryaccess includes reading and writing to memory of compute nodes withreduced operational burden on the central processing units (164). A DMAtransfer essentially copies a block of memory from one location toanother, typically from one compute node to another. While the CPU mayinitiate the DMA transfer, the CPU does not execute it.

For further explanation, FIG. 3A illustrates an exemplary Point To PointAdapter (180) useful in a parallel computer capable of broadcasting amessage in a parallel computer according to embodiments of the presentinvention. Point To Point Adapter (180) is designed for use in a datacommunications network optimized for point to point operations, anetwork that organizes compute nodes in a three-dimensional torus ormesh. Point To Point Adapter (180) in the example of FIG. 3A providesdata communication along an x-axis through four unidirectional datacommunications links, to and from the next node in the −x direction(182) and to and from the next node in the +x direction (181). Point ToPoint Adapter (180) also provides data communication along a y-axisthrough four unidirectional data communications links, to and from thenext node in the −y direction (184) and to and from the next node in the+y direction (183). Point To Point Adapter (180) in FIG. 3A alsoprovides data communication along a z-axis through four unidirectionaldata communications links, to and from the next node in the −z direction(186) and to and from the next node in the +z direction (185).

For further explanation, FIG. 3B illustrates an exemplary GlobalCombining Network Adapter (188) useful in a parallel computer capable ofbroadcasting a message in a parallel computer according to embodimentsof the present invention. Global Combining Network Adapter (188) isdesigned for use in a network optimized for collective operations, anetwork that organizes compute nodes of a parallel computer in a binarytree. Global Combining Network Adapter (188) in the example of FIG. 3Bprovides data communication to and from two children nodes (190) throughtwo links. Each link to each child node (190) is formed from twounidirectional data communications paths. Global Combining NetworkAdapter (188) also provides data communication to and from a parent node(192) through a link form from two unidirectional data communicationspaths.

For further explanation, FIG. 4 sets forth a line drawing illustratingan exemplary data communications network (108) optimized for point topoint operations useful in a parallel computer capable of broadcasting amessage in a parallel computer in accordance with embodiments of thepresent invention. In the example of FIG. 4, dots represent computenodes (102) of a parallel computer, and the dotted lines between thedots represent data communications links (103) between compute nodes.The data communications links are implemented with point to point datacommunications adapters similar to the one illustrated for example inFIG. 3A, with data communications links on three axes, x, y, and z, andto and from in six directions +x (181), −x (182), +y (183), −y (184), +z(185), and −z (186). The links and compute nodes are organized by thisdata communications network optimized for point to point operations intoa three dimensional mesh (105). The mesh (105) has wrap-around links oneach axis that connect the outermost compute nodes in the mesh (105) onopposite sides of the mesh (105). These wrap-around links form part of atorus (107). Each compute node in the torus has a location in the torusthat is uniquely specified by a set of x, y, z coordinates. Readers willnote that the wrap-around links in the y and z directions have beenomitted for clarity, but are configured in a similar manner to thewrap-around link illustrated in the x direction. For clarity ofexplanation, the data communications network of FIG. 4 is illustratedwith only 27 compute nodes, but readers will recognize that a datacommunications network optimized for point to point operations for usein broadcasting a message in a parallel computer in accordance withembodiments of the present invention may contain only a few computenodes or may contain thousands of compute nodes.

For further explanation, FIG. 5 sets forth a line drawing illustratingan exemplary data communications network (106) optimized for collectiveoperations useful in a parallel computer capable of broadcasting amessage in a parallel computer in accordance with embodiments of thepresent invention. The example data communications network of FIG. 5includes data communications links connected to the compute nodes so asto organize the compute nodes as a tree. In the example of FIG. 5, dotsrepresent compute nodes (102) of a parallel computer, and the dottedlines (103) between the dots represent data communications links betweencompute nodes. The data communications links are implemented with globalcombining network adapters similar to the one illustrated for example inFIG. 3B, with each node typically providing data communications to andfrom two children nodes and data communications to and from a parentnode, with some exceptions. Nodes in a binary tree (106) may becharacterized as a physical root node (202), branch nodes (204), andleaf nodes (206). The root node (202) has two children but no parent.The leaf nodes (206) each has a parent, but leaf nodes have no children.The branch nodes (204) each has both a parent and two children. Thelinks and compute nodes are thereby organized by this datacommunications network optimized for collective operations into a binarytree (106). For clarity of explanation, the data communications networkof FIG. 5 is illustrated with only 31 compute nodes, but readers willrecognize that a data communications network optimized for collectiveoperations for use in a parallel computer for broadcasting a message ina parallel computer accordance with embodiments of the present inventionmay contain only a few compute nodes or may contain thousands of computenodes.

In the example of FIG. 5, each node in the tree is assigned a unitidentifier referred to as a ‘rank’ (250). A node's rank uniquelyidentifies the node's location in the tree network for use in both pointto point and collective operations in the tree network. The ranks inthis example are assigned as integers beginning with 0 assigned to theroot node (202), 1 assigned to the first node in the second layer of thetree, 2 assigned to the second node in the second layer of the tree, 3assigned to the first node in the third layer of the tree, 4 assigned tothe second node in the third layer of the tree, and so on. For ease ofillustration, only the ranks of the first three layers of the tree areshown here, but all compute nodes in the tree network are assigned aunique rank.

For further explanation, FIG. 6 sets forth a line drawing illustratingexemplary compute nodes in an operational group (602) useful inbroadcasting a message in a parallel computer according to embodimentsof the present invention. The parallel computer described with referenceto FIG. 6 includes fifteen compute nodes in an operational group (602)of compute nodes for collective parallel operations of the parallelcomputer. The fifteen compute nodes in the operational group (602) areidentified as compute nodes 0-14. Compute nodes 0-14 are connectedtogether using a multicast data communications network optimized forcollective operations. Compute node 0 is configured as a physical rootin the data communications network. The physical root of the collectivetree network is the node at the top of the physical tree topology and isphysically configured to only have child nodes without a parent node.

In the example of FIG. 6, compute node 1 is assigned to be a logicalroot (600) for the operational group (602). Accordingly, the logicalroot (600) is neither the physical root nor a leaf node for the treenetwork. Compute node 1 has a message for broadcasting to the othercompute nodes of the operational group (602). The logical root (600) ofFIG. 6 concurrently transmits the message to all of the compute nodes inthe operational group directly connected to the logical root bytransmitting the message to all of the child nodes of the logical root(600) and to the parent of the logical root (600). That is, compute node1 transmits the message to compute nodes 0, 3, and 4 concurrently.

In the example of FIG. 6, when the logical root (600) transmits themessage to the nodes directly connected to the logical root (600), themessage generally begins to fan out through the network in alldirections away from the logical root (600). To propagate the message inall directions away from the logical root (600), each compute node inthe operational group (602) except the logical root (600) operates asfollows: the compute node receives the message for broadcasting to allof the compute nodes in the operational group; the compute nodetransmits the message to all of the child nodes of the physical rootexcept the child node from which the message was received if the computenode is the physical root (202); the compute node transmits the messageto all of the child nodes of the compute node if the compute nodereceived the message from the parent node for the compute node; and thecompute node transmits the message to all of the child nodes of thecompute node except the child node from which the message was receivedand transmits the message to the parent node of the compute node if thecompute node received the message from a child node and if the computenode is not the physical root.

For example, when compute node 3 receives the message from compute node1, compute node 3 transmits the message to both of its child nodes,compute nodes 7 and 8. When compute node 4 receives the message fromcompute node 1, compute node 4 transmits the message to both of itschild nodes, compute nodes 9 and 10. When compute node 0, the physicalroot (202), receives the message from compute node 1, compute node 0transmits the message to its other child node, compute node 2. Uponreceiving the message from compute node 0, compute node 2 transmits themessage to both of its child nodes, compute nodes 5 and 6. When computenode 5 receives the message from compute node 2, compute node 5transmits the message to both of its child nodes, compute nodes 11 and12. When compute node 6 receives the message from compute node 2,compute node 6 transmits the message to both of its child nodes, computenodes 13 and 14.

In the example of FIG. 6, the logical root is neither a physical rootnor one of the leaf nodes in the multicast data communications network.In some other embodiments, however, the logical root may be one of theleaf nodes in the data communications network. For further explanation,FIG. 7 sets forth a line drawing illustrating exemplary compute nodes inan operational group (602) useful in broadcasting a message in aparallel computer according to embodiments of the present invention. Theparallel computer described with reference to FIG. 7 includes fifteencompute nodes in an operational group (602) of compute nodes forcollective parallel operations of the parallel computer. The fifteencompute nodes in the operational group (602) are identified as computenodes 0-14. Compute nodes 0-14 are connected together using a multicastdata communications network optimized for collective operations. Computenode 0 is configured as a physical root in the data communicationsnetwork.

In the example of FIG. 7, compute node 7 is assigned to be a logicalroot (600) for the operational group (602). Accordingly, the logicalroot (600) is a leaf node for the tree network. Compute node 7 has amessage for broadcasting to the other compute nodes of the operationalgroup (602). As such, the logical root (600) of FIG. 7 concurrentlytransmits the message to the compute nodes in the operational groupdirectly connected to the logical root (600) by transmitting the messageto the parent of the logical root (600). That is, compute node 7transmits the message to compute node 3.

In the example of FIG. 7, when the logical root (600) transmits themessage to the nodes directly connected to the logical root (600), themessage generally begins to fan out through the network in alldirections away from the logical root (600). To propagate the message inall directions away from the logical root (600), each compute node inthe operational group (602) except the logical root (600) operates asfollows: the compute node receives the message for broadcasting to allof the compute nodes in the operational group; the compute nodetransmits the message to all of the child nodes of the physical rootexcept the child node from which the message was received if the computenode is the physical root (202); the compute node transmits the messageto all of the child nodes of the compute node if the compute nodereceived the message from the parent node for the compute node; and thecompute node transmits the message to all of the child nodes of thecompute node except the child node from which the message was receivedand transmits the message to the parent node of the compute node if thecompute node received the message from a child node and if the computenode is not the physical root.

For example, when compute node 3 receives the message from compute node7, compute node 3 transmits the message to its other child node, computenode 8, and its parent node, compute node 1. Upon receiving the messagefrom compute node 3, compute node 1 transmits the message to its otherchild node, compute node 4, and its parent node, compute node 0. Whencompute node 4 receives the message from compute node 1, compute node 4transmits the message to both of its child nodes, compute nodes 9 and10. When compute node 0, the physical root (202), receives the messagefrom compute node 1, compute node 0 transmits the message to its otherchild node, compute node 2. Upon receiving the message from compute node0, compute node 2 transmits the message to both of its child nodes,compute nodes 5 and 6. When compute node 5 receives the message fromcompute node 2, compute node 5 transmits the message to both of itschild nodes, compute nodes 11 and 12. When compute node 6 receives themessage from compute node 2, compute node 6 transmits the message toboth of its child nodes, compute nodes 13 and 14.

In the example of FIG. 6, the logical root is neither a physical rootnor one of the leaf nodes in the multicast data communications network.In the example of FIG. 7, the logical root is one of the leaf nodes inthe data communications network. In still other embodiments, however,the logical root may be the physical root in the data communicationsnetwork. For further explanation, FIG. 8 sets forth a line drawingillustrating exemplary compute nodes in an operational group (602)useful in broadcasting a message in a parallel computer according toembodiments of the present invention. The parallel computer describedwith reference to FIG. 8 includes fifteen compute nodes in anoperational group (602) of compute nodes for collective paralleloperations of the parallel computer. The fifteen compute nodes in theoperational group (602) are identified as compute nodes 0-14. Computenodes 0-14 are connected together using a multicast data communicationsnetwork optimized for collective operations. Compute node 0 isconfigured as a physical root in the data communications network.

In the example of FIG. 8, compute node 0 is also assigned to be alogical root (600) for the operational group (602). Accordingly, thelogical root (600) is the physical root (202) for the tree network.Compute node 0 has a message for broadcasting to the other compute nodesof the operational group (602). As such, the logical root (600) of FIG.8 concurrently transmits the message to the compute nodes in theoperational group directly connected to the logical root (600) bytransmitting the message to all of the child nodes of the logical root(600). That is, compute node 0 transmits the message to compute nodes 1and 2.

In the example of FIG. 8, when the logical root (600) transmits themessage to the nodes directly connected to the logical root (600), themessage generally begins to fan out through the network in alldirections away from the logical root (600). To propagate the message inall directions away from the logical root (600), each compute node inthe operational group (602) except the logical root (600) operates asfollows: the compute node receives the message for broadcasting to allof the compute nodes in the operational group; the compute nodetransmits the message to all of the child nodes of the physical rootexcept the child node from which the message was received if the computenode is the physical root (202); the compute node transmits the messageto all of the child nodes of the compute node if the compute nodereceived the message from the parent node for the compute node; and thecompute node transmits the message to all of the child nodes of thecompute node except the child node from which the message was receivedand transmits the message to the parent node of the compute node if thecompute node received the message from a child node and if the computenode is not the physical root.

For example, when compute node 1 receives the message from compute node0, compute node 1 transmits the message to both its child nodes, computenodes 3 and 4. Upon receiving the message from compute node 1, computenode 3 transmits the message to both its child nodes, compute nodes 7and 8. When compute node 4 receives the message from compute node 1,compute node 4 transmits the message to both of its child nodes, computenodes 9 and 10. Upon receiving the message from compute node 0, computenode 2 transmits the message to both of its child nodes, compute nodes 5and 6. When compute node 5 receives the message from compute node 2,compute node 5 transmits the message to both of its child nodes, computenodes 11 and 12. When compute node 6 receives the message from computenode 2, compute node 6 transmits the message to both of its child nodes,compute nodes 13 and 14.

For further explanation, FIG. 9 sets forth a flow chart illustrating anexemplary method for broadcasting a message in a parallel computeraccording to embodiments of the present invention. The parallel computerdescribed with reference to FIG. 9 includes a plurality of compute nodesconnected together using a multicast data communications network. Themulticast data communications network is optimized for collectiveoperations. One compute node is configured as a physical root in thedata communications network. The compute nodes of the parallel computerare organized into at least one operational group of compute nodes forcollective parallel operations. One compute node is assigned to be alogical root for the operational group.

The method of FIG. 9 includes transmitting (800), by the logical root toall of the compute nodes in the operational group directly connected tothe logical root, a message (802) for broadcasting to all of the computenodes in the operational group. The nodes that are ‘directly connected’to the logical root are nodes that are adjacent to the logical root inthe network topology. That is, two nodes are directly connected whenthere is a physical link that connects the two nodes in the networkwithout any intervening nodes. The logical root may transmit (800) themessage to all of the compute nodes in the operational group directlyconnected to the logical root according to the method of FIG. 9 byencapsulating the message (802) into packets that are then sent alonglinks to each of the node in the operational group that are directlyconnected to the logical root in the network topology.

As illustrated in FIG. 6 above, when the logical root is neither thephysical root nor a leaf node, the logical root may transmit (800) themessage (802) to all of the compute nodes in the operational groupdirectly connected to the logical root according to the method of FIG. 9by transmitting the message to all of the child nodes of the logicalroot and to the parent node of the logical root. As illustrated in FIG.7 above, when the logical root is not the physical root and the logicalroot is a leaf node, the logical root may transmit (800) the message(802) to all of the compute nodes in the operational group directlyconnected to the logical root according to the method of FIG. 9 bytransmitting the message to the parent of the logical root. Asillustrated in FIG. 8 above, when the logical root is the physical root,the logical root may transmit (800) the message (802) to all of thecompute nodes in the operational group directly connected to the logicalroot according to the method of FIG. 9 by transmitting the message toall of the child nodes of the logical root.

In the example of FIG. 9, when the logical root transmits the message tothe nodes directly connected to the logical root, the message generallybegins to fan out through the network in all directions away from thelogical root. To propagate the message (802) in all directions away fromthe logical root in the method of FIG. 9, the following steps areperformed for (804) each compute node in the operational group exceptthe logical root:

-   -   receiving (806), by that compute node, the message (802) for        broadcasting to all of the compute nodes in the operational        group;    -   if that compute node is the physical root, then transmitting        (810), by that compute node, the message (802) to all of the        child nodes of the physical root except the child node from        which the message (802) was received;    -   if that compute node received the message from the parent node        for that compute node and if that compute node is not a leaf        node, then transmitting (814), by that compute node, the message        (802) to all of the child nodes of that compute node; and    -   if that compute node received the message from a child node and        if that compute node is not the physical root, then transmitting        (818), by that compute node, the message (802) to all of the        child nodes of that compute node except the child node from        which the message was received and transmitting the message to        the parent node of that compute node.

As provided above, the method of FIG. 9 includes receiving (806), byeach compute node in the operational group except the logical root, themessage (802) for broadcasting to all of the compute nodes in theoperational group. Receiving (806), by each compute node, the message(802) for broadcasting to all of the compute nodes in the operationalgroup according to the method of FIG. 9 may be carried out by receivingnetwork packets from another compute node in the network andunencapsulating the message (802) from the network packets.

The method of FIG. 9 also includes determining (808), by each computenode in the operational group except the logical root, whether thatcompute node is the physical root. Each node may determine (808) whetherthat compute node is the physical root by comparing the node identifierfor that node with the identifier for the physical root in the datacommunications network. If the node identifier for that node matches theidentifier for the physical root, that compute node is the physicalroot. That compute node is not the physical root if the node identifierfor that node does not match the identifier for the physical root.

As provided above, the method of FIG. 9 includes transmitting (810), byeach compute node in the operational group except the logical root, themessage (802) to all of the child nodes of the physical root except thechild node from which the message (802) was received if that computenode is the physical root. In the method of FIG. 9, each compute nodemay transmit (810) the message (802) to all of the child nodes of thephysical root except the child node from which the message (802) wasreceived according to class routing instructions configured in eachcompute node.

The method of FIG. 9 includes determining (812), by each compute node inthe operational group except the logical root, whether that compute nodereceived the message from the parent node for that compute node and ifthat compute node is not a leaf node. Each compute node may determine(812) whether that compute node received the message from the parentnode for that compute node according to the method of FIG. 9 byidentifying the link on which the message was received and determiningwhether the identified link is connected to a parent node or a childnode in the network topology. If the identified link on which themessage (802) was received is connected to a parent node, then thatcompute node received the message from the parent node for that computenode. Each compute node may determine (812) whether that compute node isa leaf node according to the method of FIG. 9 by identifying whetherthat node has any child nodes. If that node does not have any childnodes, that compute node is a leaf node. If that node does have childnodes, that compute node is not a leaf node.

As provided above, the method of FIG. 9 includes transmitting (814), byeach compute node in the operational group except the logical root, themessage (802) to all of the child nodes of that compute node if thatcompute node received the message from the parent node for that computenode and if that compute node is not a leaf node. In the method of FIG.9, each node may transmit (814) the message (802) to all of the childnodes of that compute node according to class routing instructionsconfigured in each compute node.

The method of FIG. 9 includes determining (816), by each compute node inthe operational group except the logical root, whether that compute nodereceived the message (802) from a child node. Each compute node maydetermine (816) whether that compute node received the message (802)from a child node according to the method of FIG. 9 by identifying thelink on which the message was received and determining whether theidentified link is connected to a parent node or a child node in thenetwork topology. If the identified link on which the message (802) wasreceived is connected to a child node, then that compute node receivedthe message from the child node. If the identified link on which themessage (802) was received is connected to a parent node, then thatcompute node received the message from the parent node.

As provided above, the method of FIG. 9 includes transmitting (818), byeach compute node in the operational group except the logical root, themessage (802) to all of the child nodes of that compute node except thechild node from which the message was received and transmitting themessage to the parent node of that compute node if that compute nodereceived the message from a child node and if that compute node is notthe physical root. In the method of FIG. 9, each node may transmit (818)the message (802) to all of the child nodes of that compute node exceptthe child node from which the message was received and transmit themessage to the parent node of that compute node according to classrouting instructions configured in each compute node.

Exemplary embodiments of the present invention are described largely inthe context of a fully functional parallel computer system forbroadcasting a message in a parallel computer. Readers of skill in theart will recognize, however, that the present invention also may beembodied in a computer program product disposed on computer readablemedia for use with any suitable data processing system. Such computerreadable media may be transmission media or recordable media formachine-readable information, including magnetic media, optical media,or other suitable media. Examples of recordable media include magneticdisks in hard drives or diskettes, compact disks for optical drives,magnetic tape, and others as will occur to those of skill in the art.Examples of transmission media include telephone networks for voicecommunications and digital data communications networks such as, forexample, Ethernets™ and networks that communicate with the InternetProtocol and the World Wide Web as well as wireless transmission mediasuch as, for example, networks implemented according to the IEEE 802.11family of specifications. Persons skilled in the art will immediatelyrecognize that any computer system having suitable programming meanswill be capable of executing the steps of the method of the invention asembodied in a program product. Persons skilled in the art will recognizeimmediately that, although some of the exemplary embodiments describedin this specification are oriented to software installed and executingon computer hardware, nevertheless, alternative embodiments implementedas firmware or as hardware are well within the scope of the presentinvention.

It will be understood from the foregoing description that modificationsand changes may be made in various embodiments of the present inventionwithout departing from its true spirit. The descriptions in thisspecification are for purposes of illustration only and are not to beconstrued in a limiting sense. The scope of the present invention islimited only by the language of the following claims.

1. A method of broadcasting a message in a parallel computer, theparallel computer comprising a plurality of compute nodes connectedtogether using a multicast data communications network, the multicastdata communications network optimized for collective operations, onecompute node configured as a physical root in the data communicationsnetwork, the compute nodes organized into at least one operational groupof compute nodes for collective parallel operations of the parallelcomputer, and one compute node assigned to be a logical root for theoperational group, the method comprising: transmitting, by the logicalroot to all of the compute nodes in the operational group directlyconnected to the logical root, a message for broadcasting to all of thecompute nodes in the operational group; and for each compute node in theoperational group except the logical root: receiving, by that computenode, the message for broadcasting to all of the compute nodes in theoperational group; if that compute node is the physical root, thentransmitting, by that compute node, the message to all of the childnodes of the physical root except the child node from which the messagewas received; if that compute node received the message from the parentnode for that compute node and if that compute node is not a leaf node,then transmitting, by that compute node, the message to all of the childnodes of that compute node; and if that compute node received themessage from a child node and if that compute node is not the physicalroot, then transmitting, by that compute node, the message to all of thechild nodes of that compute node except the child node from which themessage was received and transmitting the message to the parent node ofthat compute node.
 2. The method of claim 1 wherein: the logical root isnot the physical root and the logical root is not a leaf node; andtransmitting, by the logical root to all of the compute nodes in theoperational group directly connected to the logical root, a message forbroadcasting to all of the compute nodes in the operational groupfurther comprises transmitting the message to all of the child nodes ofthe logical root and to the parent node of the logical root.
 3. Themethod of claim 1 wherein: the logical root is not the physical root andthe logical root is a leaf node; and transmitting, by the logical rootto all of the compute nodes in the operational group directly connectedto the logical root, a message for broadcasting to all of the computenodes in the operational group further comprises transmitting themessage to the parent of the logical root.
 4. The method of claim 1wherein: the logical root is the physical root; and transmitting, by thelogical root to all of the compute nodes in the operational groupdirectly connected to the logical root, a message for broadcasting toall of the compute nodes in the operational group further comprisestransmitting the message to all of the child nodes of the logical root.5. The method of claim 1 wherein the multicast data communicationsnetwork connects the plurality of compute nodes together in a treetopology.
 6. The method of claim 1 wherein the plurality of computenodes are also connected together through an additional datacommunications network optimized for point-to-point operations.
 7. Aparallel computer for broadcasting a message in the parallel computer,the parallel computer comprising a plurality of compute nodes connectedtogether using a multicast data communications network, the multicastdata communications network optimized for collective operations, onecompute node configured as a physical root in the data communicationsnetwork, the compute nodes organized into at least one operational groupof compute nodes for collective parallel operations of the parallelcomputer, and one compute node assigned to be a logical root for theoperational group, the plurality of compute nodes comprising a pluralitycomputer processors and computer memory operatively coupled to thecomputer processors, the computer memory having disposed within itcomputer program instructions capable of: transmitting, by the logicalroot to all of the compute nodes in the operational group directlyconnected to the logical root, a message for broadcasting to all of thecompute nodes in the operational group; and for each compute node in theoperational group except the logical root: receiving, by that computenode, the message for broadcasting to all of the compute nodes in theoperational group; if that compute node is the physical root, thentransmitting, by that compute node, the message to all of the childnodes of the physical root except the child node from which the messagewas received; if that compute node received the message from the parentnode for that compute node and if that compute node is not a leaf node,then transmitting, by that compute node, the message to all of the childnodes of that compute node; and if that compute node received themessage from a child node and if that compute node is not the physicalroot, then transmitting, by that compute node, the message to all of thechild nodes of that compute node except the child node from which themessage was received and transmitting the message to the parent node ofthat compute node.
 8. The parallel computer of claim 7 wherein: thelogical root is not the physical root and the logical root is not a leafnode; and transmitting, by the logical root to all of the compute nodesin the operational group directly connected to the logical root, amessage for broadcasting to all of the compute nodes in the operationalgroup further comprises transmitting the message to all of the childnodes of the logical root and to the parent node of the logical root. 9.The parallel computer of claim 7 wherein: the logical root is not thephysical root and the logical root is a leaf node; and transmitting, bythe logical root to all of the compute nodes in the operational groupdirectly connected to the logical root, a message for broadcasting toall of the compute nodes in the operational group further comprisestransmitting the message to the parent of the logical root.
 10. Theparallel computer of claim 7 wherein: the logical root is the physicalroot; and transmitting, by the logical root to all of the compute nodesin the operational group directly connected to the logical root, amessage for broadcasting to all of the compute nodes in the operationalgroup further comprises transmitting the message to all of the childnodes of the logical root.
 11. The parallel computer of claim 7 whereinthe multicast data communications network connects the plurality ofcompute nodes together in a tree topology.
 12. The parallel computer ofclaim 7 wherein the plurality of compute nodes are also connectedtogether through an additional data communications network optimized forpoint-to-point operations.
 13. A computer program product forbroadcasting a message in a parallel computer, the parallel computercomprising a plurality of compute nodes connected together using amulticast data communications network, the multicast data communicationsnetwork optimized for collective operations, one compute node configuredas a physical root in the data communications network, the compute nodesorganized into at least one operational group of compute nodes forcollective parallel operations of the parallel computer, and one computenode assigned to be a logical root for the operational group, thecomputer program product disposed upon a computer readable medium, thecomputer program product comprising computer program instructionscapable of: transmitting, by the logical root to all of the computenodes in the operational group directly connected to the logical root, amessage for broadcasting to all of the compute nodes in the operationalgroup; and for each compute node in the operational group except thelogical root: receiving, by that compute node, the message forbroadcasting to all of the compute nodes in the operational group; ifthat compute node is the physical root, then transmitting, by thatcompute node, the message to all of the child nodes of the physical rootexcept the child node from which the message was received; if thatcompute node received the message from the parent node for that computenode and if that compute node is not a leaf node, then transmitting, bythat compute node, the message to all of the child nodes of that computenode; and if that compute node received the message from a child nodeand if that compute node is not the physical root, then transmitting, bythat compute node, the message to all of the child nodes of that computenode except the child node from which the message was received andtransmitting the message to the parent node of that compute node. 14.The computer program product of claim 13 wherein: the logical root isnot the physical root and the logical root is not a leaf node; andtransmitting, by the logical root to all of the compute nodes in theoperational group directly connected to the logical root, a message forbroadcasting to all of the compute nodes in the operational groupfurther comprises transmitting the message to all of the child nodes ofthe logical root and to the parent node of the logical root.
 15. Thecomputer program product of claim 13 wherein: the logical root is notthe physical root and the logical root is a leaf node; and transmitting,by the logical root to all of the compute nodes in the operational groupdirectly connected to the logical root, a message for broadcasting toall of the compute nodes in the operational group further comprisestransmitting the message to the parent of the logical root.
 16. Thecomputer program product of claim 13 wherein: the logical root is thephysical root; and transmitting, by the logical root to all of thecompute nodes in the operational group directly connected to the logicalroot, a message for broadcasting to all of the compute nodes in theoperational group further comprises transmitting the message to all ofthe child nodes of the logical root.
 17. The computer program product ofclaim 13 wherein the multicast data communications network connects theplurality of compute nodes together in a tree topology.
 18. The computerprogram product of claim 13 wherein the plurality of compute nodes arealso connected together through an additional data communicationsnetwork optimized for point-to-point operations.
 19. The computerprogram product of claim 13 wherein the computer readable mediumcomprises a recordable medium.
 20. The computer program product of claim13 wherein the computer readable medium comprises a transmission medium.